A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence

نویسنده

  • Bahman Kalantari
چکیده

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is zero. This can be done by proving that at any complex number that is not a zero of the polynomial we can exhibit a direction of descent for the modulus. In this note we present a very short and simple proof of the existence of such descent direction. In particular, our descent direction gives rise to Newton’s method for solving a polynomial equation via modulus minimization and also makes the iterates definable at any critical point.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Basic Theorem and its Consequences

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

متن کامل

The Fundamental Theorem of Algebra via Linear Algebra

Theorem 2 is also consequence of Theorem 1, so the two theorems are equivalent. In fact, the implication Theorem 1 ⇒ Theorem 2 is usually how one first meets the fundamental theorem of algebra in a linear algebra course: it assures us that any complex square matrix has an eigenvector because the characteristic polynomial of the matrix has a complex root. But here, we will prove Theorem 2 withou...

متن کامل

The Fundamental Theorem of Algebra and Complexity Theory by Steve Smale Parti

1. The main goal of this account is to show that a classical algorithm, Newton's method, with a standard modification, is a tractable method for finding a zero of a complex polynomial. Here, by "tractable" I mean that the cost of finding a zero doesn't grow exponentially with the degree, in a certain statistical sense. This result, our main theorem, gives some theoretical explanation of why cer...

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

The Fundamental Theorem of Algebra: a Real Algebraic Proof via Sturm Chains

Sturm’s famous theorem provides an elegant algorithm to count and locate the real roots of any given real polynomial. It is less widely known that Cauchy extended this to an algebraic method to count and locate the complex roots of any given complex polynomial. We give an algebraic proof of this beautiful result, starting from the mere axioms of the fields R and C, without any further appeal to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1409.2056  شماره 

صفحات  -

تاریخ انتشار 2014